How to Strengthen Pseudo-random Generators by Using Compression
نویسندگان
چکیده
Sequence compression is one of the most promising tools for strengthening pseudo-random generators used in stream ciphers. Indeed, adding compression components can thwart algebraic attacks aimed at LFSR-based stream ciphers. Among such components are the Shrinking Generator and the Self-Shrinking Generator, as well as recent variations on Bit-Search-based decimation. We propose a general model for compression used to strengthen pseudo-random sequences. We show that there is a unique (up to length-preserving permutations) construction that reaches an optimal trade-off between output rate and security against several attacks,
منابع مشابه
The use of non-commutative algebra in cryptographically secure pseudo-random number generators
This thesis begins with a general overview of pseudo-random number generators and some of their applications. This thesis then describes their applications to cryptography, and some additional requirements imposed by cryptography. This thesis then provides an introduction to the ring of quaternions, and discusses how they can be included in pseudo-random number generators. Finally, this thesis ...
متن کاملSome applications of source coding in cryptography
It is shown that the techniques of source coding (or "data compression") can be usefully applied in cryptography. Five source coding schemes (ShannonFano coding, Huffman coding, Lynch-Davisson coding, Elias-Willems coding, and Lempel-Ziv coding) are reviewed and their characteristics delineated. It is then shown how the last three of these schemes, which are of the universal source coding type,...
متن کاملUsing GLFSRs for Pseudo-Random Memory BIST
In this work, we present the application of Generalized Linear Feedback Shift Registers (GLFSRs) for generation of patterns for pseudo-random memory Built-In SelfTest (BIST). Recently, it was shown that using GLFSRs as pattern generators for pseudo-random logic tests can increase the fault coverage noticeably in comparison to standard pseudo-random test pattern generators. Since memory faults d...
متن کاملFast and Reliable Random Number Generators for Scientific Computing
Fast and reliable pseudo-random number generators are required for simulation and other applications in Scientific Computing. We outline the requirements for good uniform random number generators, and describe a class of generators having very fast vector/parallel implementations with excellent statistical properties. We also discuss the problem of initialising random number generators, and con...
متن کاملFast and Reliable Random Number Generators
Fast and reliable pseudo-random number generators are required for simulation and other applications in Scientific Computing. We outline the requirements for good uniform random number generators, and describe a class of generators having very fast vector/parallel implementations with excellent statistical properties. We also discuss the problem of initialising random number generators, and con...
متن کامل